inversion algorithm

См. также в других словарях:

• Itoh-Tsujii inversion algorithm — The Itoh Tsujii inversion algorithm is used to invert elements in a finite field. It was introduced in 1988 and first used over GF(2 m ) using the normal basis representation of elements, however the algorithm is generic and can be used for other …   Wikipedia

• Non-blocking algorithm — In computer science, a non blocking algorithm ensures that threads competing for a shared resource do not have their execution indefinitely postponed by mutual exclusion. A non blocking algorithm is lock free if there is guaranteed system wide… …   Wikipedia

• Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… …   Wikipedia

• Floyd–Warshall algorithm — In computer science, the Floyd–Warshall algorithm (sometimes known as the WFI Algorithm or Roy–Floyd algorithm, since Bernard Roy described this algorithm in 1959) is a graph analysis algorithm for finding shortest paths in a weighted, directed… …   Wikipedia

• Strassen algorithm — In the mathematical discipline of linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm used for matrix multiplication. It is asymptotically faster than the standard matrix multiplication algorithm, but slower than… …   Wikipedia

• μ-law algorithm — Companding of μ law and A law algorithms The µ law algorithm (often u law, ulaw, or mu law) is a companding algorithm, primarily used in the digital telecommunication systems of North America and Japan. Companding algorithms reduce the dynamic… …   Wikipedia

• Μ-law algorithm — The µ law algorithm (pronounced myoo law) is a companding algorithm, primarily used in the digital telecommunication systems of North America and Japan. As with other companding algorithms, its purpose is to reduce the dynamic range of an audio… …   Wikipedia

• Mutation (genetic algorithm) — In genetic algorithms of computing, mutation is a genetic operator used to maintain genetic diversity from one generation of a population of algorithm chromosomes to the next. It is analogous to biological mutation.Mutation alters one or more… …   Wikipedia

• Algebraic-group factorisation algorithm — Algebraic group factorisation algorithms are algorithms for factoring an integer N by working in an algebraic group defined modulo N whose group structure is the direct sum of the reduced groups obtained by performing the equations defining the… …   Wikipedia

• Polynomial basis — In mathematics, the polynomial basis is a basis for finite extensions of finite fields.Let α ∈ GF( p m ) be the root of a primitive polynomial of degree m over GF( p ). The polynomial basis of GF( p m ) is then:{ 0, 1, alpha, ldots, alpha^{m… …   Wikipedia

• Coherent diffraction imaging — A diffraction pattern of a gold nanocrystal formed from using a nano area beam of coherent X rays. This reciprocal space diffraction image was taken by Ian Robinson s Group to be used in the reconstruction of a real space coherent x ray… …   Wikipedia